Subspace codes from Ferrers diagrams
نویسندگان
چکیده
In this paper we give new constructions of Ferrer diagram rank metric codes, which achieve the largest possible dimension. In particular, we prove several cases of a conjecture by T. Etzion and N. Silberstein. We also establish a sharp lower bound on the dimension of linear rank metric anticodes with a given profile. Combining our results with the multilevel construction, we produce examples of subspace codes with the largest known cardinality for the given parameters.
منابع مشابه
Maximal Ferrers Diagram Codes: Constructions and Genericity Considerations
This paper investigates the construction of rank-metric codes with specified Ferrers diagram shapes. These codes play a role in the multilevel construction for subspace codes. A conjecture from 2009 provides an upper bound for the dimension of a rank-metric code with given specified Ferrers diagram shape and rank distance. While the conjecture in its generality is wide open, several cases have ...
متن کاملSubspace Codes for Random Networks Based on Plücker Coordinates and Schubert Cells
The construction of codes in the projective space for error control in random networks has been the focus of recent research. The Plücker coordinate description of subspaces has been discussed in the context of constant dimension codes, as well as the Schubert cell description of certain code parameters. In this paper we use this classical tool to reformulate some standard constructions of cons...
متن کاملThe Half-Perimeter Generating Function of Gated and Wicketed Ferrers Diagrams
We show that the half-perimeter generating functions for the number of wicketed and gated Ferrers diagrams is algebraic. Furthermore, the generating function of the wicketed Ferrers diagrams is closely related to the generating function of the Catalan numbers. The methodology of the experimentation, as well as the proof, is the umbral transfer matrix method.
متن کاملIsotropic Constant Dimension Subspace Codes
In network code setting, a constant dimension code is a set of k-dimensional subspaces of F nq . If F_q n is a nondegenerated symlectic vector space with bilinear form f, an isotropic subspace U of F n q is a subspace that for all x, y ∈ U, f(x, y) = 0. We introduce isotropic subspace codes simply as a set of isotropic subspaces and show how the isotropic property use in decoding process, then...
متن کاملThe Expurgation-Augmentation Method for Constructing Good Plane Subspace Codes
As shown in [31], one of the five isomorphism types of optimal binary subspace codes of size 77 for packet length v = 6, constant dimension k = 3 and minimum subspace distance d = 4 can be constructed by first expurgating and then augmenting the corresponding lifted Gabidulin code in a fairly simple way. The method was refined in [36, 29] to yield an essentially computer-free construction of a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1405.2736 شماره
صفحات -
تاریخ انتشار 2014